Exact Queueing Asymptotics for Multiple Heavy-Tailed On-Off Flows
نویسندگان
چکیده
We consider a fluid queue fed by multiple On-Off flows with heavy-tailed (regularly varying) On-periods. Under fairly mild assumptions, we prove that the workload distribution is asymptotically equivalent to that in a reduced system. The reduced system consists of a ‘dominant’ subset of the flows, with the original service rate subtracted by the mean rate of the other flows. We describe how a dominant set may be determined from a simple knapsack formulation. We exploit a powerful intuitive argument to obtain the exact asymptotics for the reduced system. Combined with the reduced-load equivalence, the results for the reduced system provide an asymptotic characterization of the buffer behavior. 2000 Mathematics Subject Classification: 60K25 (primary), 60F10, 90B18, 90B22 (secondary).
منابع مشابه
Exact Asymptotics for Fluid Queues Fed by Multiple Heavy-tailed On–off Flows by Bert Zwart, Sem Borst
We consider a fluid queue fed by multiple On–Off flows with heavytailed (regularly varying) On periods. Under fairly mild assumptions, we prove that the workload distribution is asymptotically equivalent to that in a reduced system. The reduced system consists of a “dominant” subset of the flows, with the original service rate subtracted by the mean rate of the other flows. We describe how a do...
متن کاملTail Asymptotics for Cumulative Processes Sampled at Heavy-tailed Random times with Applications to Queueing Models in Markovian Environments
This paper considers the tail asymptotics for a cumulative process {B(t); t ≥ 0} sampled at a heavy-tailed random time T . The main contribution of this paper is to establish several sufficient conditions for the asymptotic equality P(B(T ) > bx) ∼ P(M(T ) > bx) ∼ P(T > x) as x → ∞, where M(t) = sup0≤u≤t B(u) and b is a certain positive constant. The main results of this paper can be used to ob...
متن کاملAsymptotic behavior of generalized processor sharing queues under subexponential assumptions
We analyze the behavior of Generalized Processor Sharing (GPS) queues with heavy-tailed service times. We compute the exact tail asymptotics of the stationary workload of an individual class and give new conditions for reduced-load equivalence and induced burstiness to hold. We also show that both phenomena can occur simultaneously. Our proofs rely on the single big event theorem and new fluid ...
متن کاملExact asymptotics for fluid queues fed by multiple heavy- tailed on-off flows
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملGeneralised Processor Sharing Networks Fed by Heavy-tailed Traffic Flows
We consider networks where traffic is served according to the Generalised Processor Sharing (GPS) principle. GPS-based scheduling algorithms are considered important for providing differentiated quality of service in integrated-services networks. We are interested in the workload of a particular flow i at the bottleneck node on its path. Flow i is assumed to have long-tailed traffic characteris...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001